Data Mining and Knowledge Discovery manuscript No. (will be inserted by the editor) Fast approximation of betweenness centrality through sampling Matteo Riondato ·

Source URL: matteo.rionda.to

• Network theory
• Graph theory
• Centrality
• Betweenness centrality
• Distance
• Shortest path problem
• Connected component
• GirvanNewman algorithm
• Wiener connector

Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)

Source URL: bioinfo.ict.ac.cn

• Operations research
• Dynamic programming
• Combinatorial optimization
• Packing problems
• Cryptography
• Knapsack problem
• Subset sum problem
• Approximation algorithm
• Algorithm
• Greedy algorithm
• Heuristic
• Branch and bound

Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

Source URL: www.cs.yale.edu

• Quantum complexity theory
• Computational complexity theory
• Cryptography
• Functions and mappings
• Secure multi-party computation
• Secure two-party computation
• Communication complexity
• Limit of a function
• Pi
• Cryptographic protocol
• PP
• Approximation algorithm

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni1 and Thomas Rothvoß2 1

Source URL: www.math.washington.edu

• Computational complexity theory
• Operations research
• Facility location problem
• Steiner tree problem
• Shortest path problem
• Approximation algorithm
• Low-rank approximation

Auto-Approximation of Graph Computing Zechao Shang, Jeffrey Xu Yu The Chinese University of Hong Kong Motivation I

Source URL: acmsocc.github.io

• Mathematical analysis
• Mathematics
• Approximation algorithm
• Computational complexity theory
• Algorithm
• Pi
• Approximation error
• Logarithm

GENERALIZED GAUSSIAN MARKOV RANDOM FIELD IMAGE RESTORATION USING VARIATIONAL DISTRIBUTION APPROXIMATION S. Derin Babacan† , Rafael Molina‡ , Aggelos K. Katsaggelos† † ‡

Source URL: decsai.ugr.es

• Probability distributions
• Gamma distribution
• Normal distribution
• Constructible universe
• NC
• Hyperprior
• Beta distribution
• Expectationmaximization algorithm

Exact-Present Solution with Consistent-Future Approximation: A Gridless Algorithm to Solve Stochastic Dynamic Models Wouter J. Den Haan, Michal L. Kobielarz and Pontus Rendahl∗ January 19, 2016

Source URL: www.wouterdenhaan.com

AN APPROXIMATION ALGORITHM FOR COUNTING CONTINGENCY TABLES Alexander Barvinok, Zur Luria, Alex Samorodnitsky, and Alexander Yong March 2008

Source URL: www.math.lsa.umich.edu

• Mathematics
• Algebra
• Mathematical analysis
• Linear algebra
• Matrix theory
• Matrix
• Distribution
• Permanent

PHYSICAL REVIEW B 90, Cubic scaling algorithm for the random phase approximation: Self-interstitials and vacancies in Si Merzuk Kaltak, Jiˇr´ı Klimeˇs, and Georg Kresse* University of Vienna, Faculty o

Source URL: www.sfb-vicom.at

Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2

Source URL: fpt.akt.tu-berlin.de

• Dynamic programming
• Routing algorithms
• Eulerian path
• Shortest path problem
• FloydWarshall algorithm
• NP-complete problems
• Planar separator theorem
• Dominating set